- majority algorithm
- мажоритарный алгоритм
The English-Russian dictionary on reliability and quality control. 2015.
majority algorithm
Смотреть что такое "majority algorithm" в других словарях:
Weighted Majority Algorithm — In machine learning, Weighted Majority Algorithm (WMA) is a meta learning algorithm used to construct a compound algorithm from a pool of prediction algorithms, which could be any type of learning algorithms, classifiers, or even real human… … Wikipedia
Majority logic decoding — In error detection and correction, majority logic decoding is a method to decode repetition codes, based on the assumption that the largest number of occurrences of a symbol was the transmitted symbol. Contents 1 Theory 2 Algorithm 2.1… … Wikipedia
Chandra–Toueg consensus algorithm — The Chandra–Toueg consensus algorithm is an algorithm for solving consensus in a network of unreliable processes equipped with an eventually strong failure detector. The failure detector is an abstract version of timeouts; it signals to each… … Wikipedia
Paxos algorithm — Paxos is a family of protocols for solving consensus in a network of unreliable processors.Consensus is the process of agreeing on one result among a group of participants. This problem becomes difficult when the participants or their… … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Monte Carlo algorithm — In computing, a Monte Carlo algorithm is a randomized algorithm whose running time is deterministic, but whose output may be incorrect with a certain (typically small) probability. The related class of Las Vegas algorithms is also randomized, but … Wikipedia
K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… … Wikipedia
Itoh-Tsujii inversion algorithm — The Itoh Tsujii inversion algorithm is used to invert elements in a finite field. It was introduced in 1988 and first used over GF(2 m ) using the normal basis representation of elements, however the algorithm is generic and can be used for other … Wikipedia
BrownBoost — is a boosting algorithm that may be robust to noisy datasets. BrownBoost is an adaptive version of the boost by majority algorithm. As is true for all boosting algorithms, BrownBoost is used in conjunction with other machine learning methods.… … Wikipedia
Manfred K. Warmuth — Manfred Klaus Warmuth Fields Computer Science … Wikipedia
BrownBoost — BrownBoost алгоритм бустинга, который показал свою эффективность на зашумленных наборах данных. Как и все алгоритмы бустинга, BrownBoost используется в сочетании с другими алгоритмами машинного обучения. Алгоритм BrownBoost был предложен… … Википедия
